Linear Cryptanalysis Using Multiple Approximations
نویسندگان
چکیده
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limits of this extension when applied to DES, but illustrate that it is generally applicable and might be exceptionally successful when applied to other block ciphers. This forces us to reconsider some of the initial attempts to quantify the resistance of block ciphers to linear cryptanalysis, and by taking account of this new technique we cover several issues which have not yet been considered.
منابع مشابه
New Results in the Linear Cryptanalysis of DES
Two open problems on using Matsui’s Algorithm 2 with multiple linear approximations posed earlier by Biryukov, De Cannière and M. Quisquater at Crypto’04 are solved in the present paper. That improves the linear cryptanalysis of 16-round DES reported by Matsui at Crypto’94. keywords: linear cryptanalysis, multiple linear approximations, success probability, MRHS linear equations, gluing algorithm.
متن کاملLinear Cryptanalysis Using Multiple Approximations and FEAL
We describe the results of experiments on the use of multiple approximations in a linear cryptanalytic attack on FEAL; we pay particular attention to FEAL-8. While these attacks on FEAL are interesting in their own right, many important and intriguing issues in the use of multiple approximations are brought to light.
متن کاملLinear Attack Using Multiple Linear Approximations
One of Kaliski and Robshaw’s algorithms, which is used for the linear attack on block ciphers with multiple linear approximations and introduced as Algorithm 2M in this paper, looks efficient but lacks any theoretical and mathematical description. It means there exists no way to estimate the data complexity required for the attack by the algorithm except experiments of the reduced variants. In ...
متن کاملMultivariate Profiling of Hulls for Linear Cryptanalysis
Extensions of linear cryptanalysis making use of multiple approximations, such as multiple and multidimensional linear cryptanalysis, are an important tool in symmetric-key cryptanalysis, among others being responsible for the best known attacks on ciphers such as Serpent and present. At CRYPTO 2015, Huang et al. provided a refined analysis of the key-dependent capacity leading to a refined key...
متن کاملOverestimates for the Gain of Multiple Linear Approximations
We show that Corollary 1 of “On Multiple Linear Approximations” (Crypto 2004 – LNCS 3152) is incorrect. In particular, the value given for the gain by Corollary 1 is likely to be a significant overestimate of this quantity. Thus any data requirements for linear cryptanalysis with multiple linear approximations based on this value for the gain are highly questionable.
متن کاملMultidimensional Linear Cryptanalysis of Reduced Round Serpent
Various authors have previously presented di erent approaches how to exploit multiple linear approximations to enhance linear cryptanalysis. In this paper we present a new truly multidimensional approach to generalise Matsui’s Algorithm 1. We derive the statistical framework for it and show how to calculate multidimensional probability distributions based on correlations of onedimensional linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994